package com.vinfai.datastructures.tree;

import java.util.Collections;
import java.util.LinkedList;

public class LinkedBinaryTree {
	private Node root;
	
	public void addNode(Node parent,int data,boolean isLeft){
		
	}
	
	public int deep(Node node){
//		Collections.reverse(list)
		//LinkedList<E>
		return 0;
	}
//	Collections.
}


class Node{
	private int data;//数据域
	
	private Node lefeNode;
	
	private Node rightNode;
	
	
	public int getData() {
		return data;
	}

	public void setData(int data) {
		this.data = data;
	}

	public Node getLefeNode() {
		return lefeNode;
	}

	public void setLefeNode(Node lefeNode) {
		this.lefeNode = lefeNode;
	}

	public Node getRightNode() {
		return rightNode;
	}

	public void setRightNode(Node rightNode) {
		this.rightNode = rightNode;
	}
	
	
	
}
